Time-space trade-offs for branching programs
نویسندگان
چکیده
منابع مشابه
Time-space Trade-offs for Voronoi Diagrams
Let S be a planar n-point set. Classically, one can find the Voronoi diagram VD(S) for S in O(n log n) time and O(n) space. We study the situation when the available workspace is limited: for s ∈ {1, . . . , n}, an s-workspace algorithm has read-only access to an input array with the points from S in arbitrary order, and it may use only O(s) additional words of Θ(log n) bits for reading and wri...
متن کاملOptimal Time-Space Trade-Offs for Sorting
We study the fundamental problem of sorting in a sequential model of computation and in particular consider the time-space trade-off (product of time and space) for this problem. Beame has shown a lower bound of Ω(n) for this product leaving a gap of a logarithmic factor up to the previously best known upper bound of O(n log n) due to Frederickson. Since then, no progress has been made towards ...
متن کاملSimple Space-Time Trade-Offs for AESA
We consider indexing and range searching in metric spaces. The best method known is AESA, in practice requiring the fewest number of distance evaluations to answer range queries. The problem with AESA is its space complexity, requiring storage for Θ(n) distance values to index n objects. We give several methods to reduce this cost. The main observation is that exact distance values are not need...
متن کاملTime/Space Trade-Offs for Reversible Computation
A reversible Turing machine is one whose transition function is 1, so that no instantaneous description (ID) has more than one predecessor. Using a pebbling argument, this paper shows that, for any e > 0, ordinary multitape Turing machines using time T and space S can be simulated by reversible ones using time O(T +) and space O(S log T) or in linear time and space O(ST). The former result impl...
متن کاملTime-Space Tradeoffs for Branching Programs
We obtain the first non-trivial time-space tradeoff lower bound for functions f : {0, 1}n → {0, 1} on general branching programs by exhibiting a Boolean function f that requires exponential size to be computed by any branching program of length (1 + ǫ)n, for some constant ǫ > 0. We also give the first separation result between the syntactic and semantic read-k models [BRS93] for k > 1 by showin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1986
ISSN: 0022-0000
DOI: 10.1016/0022-0000(86)90004-8